Resolving Ellipsis in Clarification
نویسندگان
چکیده
We offer a computational analysis of the resolution of ellipsis in certain cases of dialogue clarification. We show that this goes beyond standard techniques used in anaphora and ellipsis resolution and requires operations on highly structured, linguistically heterogeneous representations. We characterize these operations and the representations on which they operate. We offer an analysis couched in a version of Head-Driven Phrase Structure Grammar combined with a theory of information states (IS) in dialogue. We sketch an algorithm for the process of utterance integration in ISs which leads to grounding or clarification.
منابع مشابه
Resolving Elided Scopes of Modality in OntoAgent
This paper describes how intelligent agents modeled within the OntoAgent cognitive architecture treat the linguistic phenomenon of modal scope ellipsis. The approach offers two innovative aspects with respect to cognitive modeling: (1) ellipsis treatment is distributed across processing modules in a psychologically plausible way and (2) agents are prepared to incorporate calculations of utility...
متن کاملJONATHAN GINZBURG and ROBIN COOPER CLARIFICATION, ELLIPSIS, AND THE NATURE OF CONTEXTUAL UPDATES IN DIALOGUE
The paper investigates an elliptical construction, Clarification Ellipsis, that occurs in dialogue. We suggest that this provides data that demonstrates that updates resulting from utterances cannot be defined in purely semantic terms, contrary to the prevailing assumptions of existing approaches to dynamic semantics. We offer a computationally oriented analysis of the resolution of ellipsis in...
متن کاملOn Antecedent Contained Ellipsis*
This paper argues that elliptical VPs do not necessarily present cases of VP ellipsis. Certain relative clauses that contain elliptical VPs are analysed as instances of transitive verb phrase ellipsis. A storing account of ellipsis resolution is given. Resolution of TVP ellipsis is achieved by resolving a binary relation that derives from an antecedent TVP. This avoids the problem of antecedent...
متن کاملGrammar for ellipsis resolution in Japanese
This paper elucidates the linguistic mechanisms for resolving ellipsis (zero anaphor). The mechanisms consist of three tiers of linguistic system. [1] Japanese sentences are structured in such a way to anchor the topic, which is predominantly the subject (by Sentence devices), [2] with argument inferring cues on the verbal predicate (by Predicate devices), and [3] are cohesively sequenced with ...
متن کاملUsing Dependent Record Types in Clarification Ellipsis
We present a sketch of a formulation of an analysis of clarification ellipsis using dependent record types as they have been developed in Martin-Löf type theory. Record types provide a semantic formalism which at the same time as containing the normal paraphernalia of semantics (functions, binding, quantification) also have strong similarities to typed feature structures as used in HPSG. We arg...
متن کامل